Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
781	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
782	Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:53 Complexity classes Probabilistic complexity theory Quantum complexity theory Analysis of algorithms Randomized algorithm PP NP P Theoretical computer science Computational complexity theory Applied mathematics
783	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
784	T H E ARCHITECTURE O F COMPLEXITY HERBERT A. SIMON* Professor of Administration, Carnegie Institute of Technology (Read April 26, A N U M B E R of proposals have been advanced in Add to Reading List Source URL: pcp.vub.ac.be Language: English - Date: 2014-05-02 12:19:59 Structure Nature Complex systems theory Holism Systems theory Complexity Complex system Hierarchy Adaptive system Systems Science Cybernetics
785	Interconnection Semantics for Keyword Search in XML Sara Cohen∗ Yaron Kanza Technion—Israel Institute of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-11-04 06:34:23 Complexity classes NP-complete problems Logic in computer science Graph connectivity Graph theory Tree Connectivity L Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
786	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Time, space, and precision: Revisiting classic problems in computational geometry with degree-driven analysis Jack Snoeyink∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-04 14:37:40 Analysis of algorithms Computational complexity theory Computer arithmetic Algorithm Mathematical logic Floating point Computational geometry Time complexity Model of computation Theoretical computer science Applied mathematics Computer science
787	Presburger Award 2012 The Presburger Award Committee 2012, consisting of Monika Henzinger, Antonin Kucera, and Stefano Leonardi (chair) has unanimously decided to propose *********************************************** Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2014-01-29 10:45:05** Applied mathematics Mathematics Computational complexity theory List decoding Venkatesan Guruswami Probabilistic complexity theory Presburger Award Reed–Solomon error correction Probabilistically checkable proof Error detection and correction Theoretical computer science Coding theory
788	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Cole’s Parametric Search Technique Made Practical Michael T. Goodrich Pawel Pszona Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Order theory Quicksort Algorithm Merge sort Time complexity Selection algorithm Sorting network Randomized algorithm Self-balancing binary search tree Mathematics Sorting algorithms Theoretical computer science
789	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
790	Distinct Excluded Blocks and Grammatical Complexity of Dynamical Systems Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2013-03-26 14:35:02 Constructible universe Spectral theory English orthography

UPDATE